Convergence of simultaneous perturbation stochastic approximation for nondifferentiable optimization

نویسندگان

  • Ying He
  • Michael C. Fu
  • Steven I. Marcus
چکیده

In this paper, we consider Simultaneous Perturbation Stochastic Approximation (SPSA) for function minimization. The standard assumption for convergence is that the function be three times differentiable, although weaker assumptions have been used for special cases. However, all work that we are aware of at least requires differentiability. In this paper, we relax the differentiability requirement and prove convergence using convex analysis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic Optimization Algorithms for Support Vector Machines Classification

In this paper, we consider the problem of semi-supervised binary classification by Support Vector Machines (SVM). This problem is explored as an unconstrained and non-smooth optimization task when part of the available data is unlabelled. We apply non-smooth optimization techniques to classification where the objective function considered is non-convex and nondifferentiable and so difficult to ...

متن کامل

Stochastic Approximation on Discrete Sets Using Simultaneous Perturbation Difference Approximations

A stochastic approximation method for optimizing a class of discrete functions is considered. The procedure is a version of the Simultaneous Perturbation Stochastic Approximation (SPSA) method that has been modified to obtain a stochastic optimization method for cost functions defined on a grid of points in Euclidean p-space having integer components. We discuss the algorithm and examine its co...

متن کامل

A Constrained Simultaneous Perturbation Stochastic Approximation Algorithm Based on Penalty Function - Intelligent Control (ISIC), 1998. Held jointly with IEEE International Symposium on Computational

1.1. Available Techniques In this paper, we present a stochastic approximation algorithm based on penalty function method and a simultaneous perturbation gradient estimate for solving stochastic optimization problems with general inequality constraints. We also presents a very general convergence result for the proposed algorithm.

متن کامل

Randomized Difference Two-Timescale Simultaneous Perturbation Stochastic Approximation Algorithms for Simulation Optimization of Hidden Markov Models

We propose two finite difference two-timescale simultaneous perturbation stochastic approximation (SPSA) algorithms for simulation optimization of hidden Markov models. Stability and convergence of both the algorithms is proved. Numerical experiments on a queueing model with high dimensional parameter vectors demonstrate orders of magnitude faster convergence using these algorithms over related...

متن کامل

An Improved Spsa Algorithm for Stochastic Optimization with Bound Constraints

We show that the Simultaneous Perturbation Stochastic Approximation (SPSA) algorithm with projection may exhibit slow convergence in constrained stochastic optimization problems when the optimum is situated on the constraints. The cause of the slow convergence is a geometric interaction between the projection operator and the SPSA gradient estimate. The effect of this interaction can be describ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Automat. Contr.

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2003